Using ATL for Checking Models
نویسندگان
چکیده
منابع مشابه
Symbolic Model-checking for Resource-Bounded ATL
In this paper we present a symbolic implementation of a model checking algorithm for the verification of properties expressed in Resource-Bounded Alternating Time Temporal Logic (RB-ATL). The implementation is based on the model checker MCMAS. We evaluate the performance of our implementation using simple multiagent model checking problems of increasing complexity.
متن کاملOn the Complexity of ATL and ATL* Module Checking
Module checking has been introduced in late 1990s to verify open systems, i.e., systems whose behavior depends on the continuous interaction with the environment. Classically, module checking has been investigated with respect to specifications given as CTL and CTL∗ formulas. Recently, it has been shown that CTL (resp., CTL∗) module checking offers a distinctly different perspective from the be...
متن کاملVerification of JADE Agents Using ATL Model Checking
It is widely accepted that the key to successfully developing a system is to produce a thorough system specification and design. This task requires an appropriate formal method and a suitable tool to determine whether or not an implementation conforms to the specifications. In this paper we present an advanced technique to analyse, design and debug JADE software agents, using Alternating-time T...
متن کاملModel Checking ATL and its epistemic extensions
We present an OBDD-based methodology for verifying multi-agent systems specified by the logic ATL. We present an implementation, discuss traditional multi-agent systems examples, and report experimental results by comparing the implementation to MOCHA, a state-of-the-art model checker for ATL.
متن کاملMinimisation of ATL ^* Models
The aim of this work is to provide a general method to minimize the size (number of states) of a model M of an ATL∗ formula. Our approach is founded on the notion of alternating bisimulation: given a model M, it is transformed in a stepwise manner into a new model M’ minimal with respect to bisimulation. The method has been implemented and will be integrated to the prover TATL, that constructiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.01.015